minimum distance decoding造句

Minimum distance decoding is also known as " nearest neighbour decoding ".
Minimum distance decoding is a reasonable decoding method when the following conditions are met:
errors made by the channel ( since if no more than t errors are made then minimum distance decoding will still correctly decode the incorrectly transmitted codeword ).
Ordinary minimum distance decoding would lookup the vector z in a table of size | C | for the nearest match-i . e . an element ( not necessarily unique ) c \ in C with
Given a received codeword x \ in \ mathbb { F } _ 2 ^ n, "'minimum distance decoding "'picks a codeword y \ in C to minimise the Hamming distance:
It's difficult to find minimum distance decoding in a sentence. 用minimum distance decoding造句挺难的

Note that if the probability of error on a discrete memoryless channel p is strictly less than one half, then " minimum distance decoding " is equivalent to " maximum likelihood decoding ", since if